--- title: "L1-078 吉老师的回归" created: 2025-11-28 tags: - 算法 --- # L1-078 吉老师的回归 ## 题目 [L1-078 吉老师的回归](https://pintia.cn/problem-sets/994805046380707840/exam/problems/type/7?problemSetProblemId=1386335159927652357&page=0) ![[image-5ff144e3.png]] ## 思路分析 ## 代码实现 ```cpp #include using namespace std; #define endl '\n' using ll = long long; using ull = unsigned long long; using PII = pair; using Pll = pair; int dx[4]={-1,0,1,0},dy[4]={0,1,0,-1}; const int inf = 0x3f3f3f3f; int main(){ ios::sync_with_stdio(0),cin.tie(0),cout.tie(0); int n,m;cin>>n>>m; int cnt=0; cin.ignore(); while(n--){ string s;getline(cin,s); if(s.find("qiandao")!=-1 || s.find("easy")!=-1) continue; if(cnt==m){ cout<